PROPER COLORINGS AND p-PARTITE STRUCTURES OF THE ZERO DIVISOR GRAPH
نویسنده
چکیده
Let Γ(Zm) be the zero divisor graph of the ring Zm. In this paper we explore the p-partite structures of Γ(Zm), as well as determine a complete classification of the chromatic number of Γ(Zm). In particular, we explore how these concepts are related to the prime factorization of m.
منابع مشابه
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}
Let G = (V,E) be an undirected graph without loops and multiple edges [1], V (G) and E(G) be the sets of vertices and edges of G, respectively. The degree of a vertex x ∈ V (G) is denoted by dG(x), the maximum degree of a vertex of G-by ∆(G), and the chromatic index [2] of G-by χ(G). A graph is regular, if all its vertices have the same degree. If α is a proper edge coloring of the graph G [3],...
متن کاملMaximizing the Chances of a Color Match—Web Supplement
Proof. Let Km denote the complete graph on m vertices. Given an n-color list for each vertex of Km, let p denote the probability of obtaining a match. We will prove that having identical lists minimizes p̄ = 1− p. To compute p̄, we divide the number of proper colorings by the total number of ways to color the vertices. The latter is just n, regardless of whether or not the lists are identical. So...
متن کاملAn Extremal Property of Turán Graphs
Let Fn,tr(n) denote the family of all graphs on n vertices and tr(n) edges, where tr(n) is the number of edges in the Turán’s graph Tr(n) – the complete r-partite graph on n vertices with partition sizes as equal as possible. For a graph G and a positive integer λ, let PG(λ) denote the number of proper vertex colorings of G with at most λ colors, and let f(n, tr(n), λ) = max{PG(λ) : G ∈ Fn,tr(n...
متن کاملA Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of k-partite k-uniform Hypergraphs
We study the list coloring number of k-uniform k-partite hypergraphs. Answering a question of Ramamurthi and West, we present a new upper bound which generalizes Alon and Tarsi’s bound for bipartite graphs, the case k = 2. Our results hold even for paintability (on-line list colorability). To prove this additional strengthening, we provide a new subject-specific version of the Combinatorial Nul...
متن کاملHow many delta-matroids are there?
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcct-colorings, and rainbow colorings, and many more. N. Linial (1986) showed that the chromatic polynomial χ(G;X) is #P-hard to evaluate for all but three values X = 0, 1, 2, wh...
متن کامل